Equidistant Rank Metric Codes: Construction and Properties
نویسندگان
چکیده
Abstract. This paper introduces a new construction for q-ary equidistant code C with rank metric where q is a power of 2. Investigations on structural properties of the proposed code are carried out. The highlight of the paper is that the kernel of the code C happens to be an equidistant constant-weight code of same size as C and is shown to be C+ C. The bounds on number of steps that are required to construct the equidistant code are also given. Moreover, our construction is independent of the choice of metric, though our investigation mainly focuses about rank metric.
منابع مشابه
Equidistant codes in the Grassmannian
Equidistant codes over vector spaces are considered. For k-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codeswhichmight produce the largest non-sunflower codes. A novel construction, based on the Plücker embedding, for 1-intersecting codes of k-dimensional subspaces over Fq , n ≥ k+1 2 , where the cod...
متن کاملOn (Partial) Unit Memory Codes Based on Gabidulin Codes
Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so–called sum rank metric. For the sum rank metric, the free rank distance, the extended row ran...
متن کاملDecoding of Block and Convolutional Codes in Rank Metric DISSERTATION
Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays...
متن کاملDecoding of block and convolutional codes in rank metric
R ank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowaday...
متن کاملRank-Metric Codes and $q$-Polymatroids
We study some algebraic and combinatorial invariants of rank-metric codes, specifically generalized weights. We introduce q-polymatroids, the q-analogue of polymatroids, and develop their basic properties. We show that rank-metric codes give rise to q-polymatroids, and that several of their structural properties are captured by the associated combinatorial object. Introduction and Motivation Du...
متن کامل